Automata | a Theory Dedicated towards Formal Circuit Synthesis
نویسنده
چکیده
This is a technical report about a theory named Automata. Automata is an arithmetic for synchronous circuits. It provides means for representing and transforming circuit descriptions at the RT level and gate level in a mathemtical manner. Automata has been implemented in the HOL theorem proving environment. Preproven theorems are designed for performing standard synthesis steps such as state encoding, retiming and state minimization in a mathematical manner via logical derivation.
منابع مشابه
An Automata Theory Dedicated towards
We present a theory for automata in HOL, which is dedicated towards formal hardware synthesis. The theory contains deenitions for formally representing and transforming automata. In this approach hardware is represented by automata descriptions and formal synthesis is performed by applying formally proven theorems. The approach presented is constructive | i.e. starting from speciications at hig...
متن کاملPossibilities, Limitations and Problems in Retiming | a View from a Logical Perspective
This paper gives a formal description of retiming and analyzes its possibilities. The paper is based on a theory for automata in HOL, which is dedicated towards formal hardware representation and transformations. In this approach hardware is represented by automata descriptions and formal synthesis is performed by applying formally proven theorems.
متن کاملCompression Using Antidictionaries
We give a new text compression scheme based on Forbidden Words ("antidictionary"). We prove that our algorithms attain the entropy for equilibrated binary sources. One of the main advantage of this approach is that it produces very fast decompressors. A second advantage is a synchronization property that is helpful to search compressed data and to parallelize the compressor. Our algorithms can ...
متن کاملTime Domain Verification of Oscillator Circuit Properties
The application of formal methods to analog and mixed signal circuits requires efficient methods for constructing abstractions of circuit behaviors. This paper concerns the verification of properties of oscillator circuits. Generic monitor automata are proposed to facilitate the application of hybrid system reachability computations to characterize time domain features of oscillatory behavior, ...
متن کاملAnalysis of a Mixed-Signal Circuit in Hybrid Process Algebra ACPsrt
ACPsrt hs is a hybrid process algebra obtained by extending a combination of two existing extensions of Algebra of Communicating Processes (ACP), namely the process algebra with continuous relative timing and the process algebra with propositional signals, for the formal specification and analysis of hybrid systems. In addition to equational axioms, this hybrid process algebra has rules to deri...
متن کامل